A Witness Extraction Technique by Proof Normalization Based on Interactive Realizability
نویسنده
چکیده
We present a new set of reductions for derivations in natural deduction that can extract witnesses from closed derivations of simply existential formulas in Heyting Arithmetic (HA) plus the Excluded Middle Law restricted to simply existential formulas (EM1), a system motivated by its interest in proof mining. The reduction we have for classical logic are quite different from all existing ones. They are inspired by the informal idea of learning by making falsifiable hypothesis and checking them, and by the Interactive Realizability interpretation. We extract the witnesses directly from derivations in HA+EM1 by reduction, without encoding derivations by a realizability interpretation.
منابع مشابه
Interactive Realizability, Monads and Witness Extraction
In this dissertation we collect some results about “interactive realizability”, a realizability semantics that extends the Brouwer-Heyting-Kolmogorov interpretation to (sub-)classical logic, more precisely to first-order intuitionistic arithmetic (Heyting Arithmetic, HA) extended by the law of the excluded middle restricted to Σ1 formulas (EM1), a system motivated by its interest in proof minin...
متن کاملInteractive Realizability for Classical Peano Arithmetic with Skolem Axioms
Interactive realizability is a computational semantics of classical Arithmetic. It is based on interactive learning and was originally designed to interpret excluded middle and Skolem axioms for simple existential formulas. A realizer represents a proof/construction depending on some state, which is an approximation of some Skolem functions. The realizer interacts with the environment, which ma...
متن کاملRealizability and Strong Normalization for a Curry-Howard Interpretation of HA + EM1
We present a new Curry-Howard correspondence for HA + EM1, constructive Heyting Arithmetic with the excluded middle on Σ1-formulas. We add to the lambda calculus an operator ‖a which represents, from the viewpoint of programming, an exception operator with a delimited scope, and from the viewpoint of logic, a restricted version of the excluded middle. We motivate the restriction of the excluded...
متن کاملRealizability for Peano Arithmetic with Winning Conditions in HON Games
We build a realizability model for Peano arithmetic based on winning conditions for HON games. First we define a notion of winning strategies on arenas equipped with winning conditions. We prove that the interpretation of a classical proof of a formula is a winning strategy on the arena with winning condition corresponding to the formula. Finally we apply this to Peano arithmetic with relativiz...
متن کاملRelating Classical Realizability and Negative Translation for Existential Witness Extraction
Friedman showed how to turn a classical proof of a Σ 1 formula into an intuitionistic proof of the same formula, thus giving an effective method to extract witnesses from classical proofs of such formulae. In this paper we show how to achieve the same goal efficiently using Krivine realizability with primitive numerals, and prove that the corresponding program is but the direct-style equivalent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1305.3388 شماره
صفحات -
تاریخ انتشار 2013